Timed Intruder Models have been proposed for the verification ofCyber-Physical Security Protocols (CPSP) amending the traditional Dolev-Yaointruder to obey the physical restrictions of the environment. Since to learn amessage, a Timed Intruder needs to wait for a message to arrive, mounting anattack may depend on where Timed Intruders are. It may well be the case that inthe presence of a great number of intruders there is no attack, but there is anattack in the presence of a small number of well placed intruders. Therefore, amajor challenge for the automated verification of CPSP is to determine how manyTimed Intruders to use and where should they be placed. This paper answers thisquestion by showing it is enough to use the same number of Timed Intruders asthe number of participants. We also report on some preliminary experimentalresults in discovering attacks in CPSP.
展开▼
